Tight Space Self-Stabilizing Uniform l-Mutual Exclusion
نویسندگان
چکیده
منابع مشابه
A Self-stabilizing Algorithm with Tight Bounds for Mutual Exclusion on a Ring
In [Dij74] Dijkstra introduced the notion of self-stabilizing algorithms and presented, among others, an algorithm with three states for the problem of mutual exclusion on a ring of processors. In this work we present a new three state self-stabilizing algorithm for mutual exclusion, with a tight bound of 56n 2 +O(n) for the worst case complexity, which is the number of moves of the algorithm u...
متن کاملUniform and Self-Stabilizing Fair Mutual Exclusion on Unidirectional Rings under Unfair Distributed Daemon
This paper presents a uniform randomized self-stabilizing mutual exclusion algorithm for an anonymous unidirectional ring of any size n, running under an unfair distributed scheduler (d-daemon). The system is stabilized with probability 1 in OðnÞ expected number of steps, and each process is privileged at least once in every 2n steps, once it is stabilized. # 2002 Elsevier Science (USA)
متن کاملColor Optimal Self-Stabilizing Depth-First Token Circulation
The notion of self-stabilization was rst introduced by Dijkstra : it is the property for a system to eventually recover itself a legitimate state after any perturbation modifying the memory state. This paper proposes a self-stabilizing depth-rst token circulation protocol for uniform rooted networks. Such an algorithm is very convenient to obtain the mutual exclusion or to construct a spanning ...
متن کاملSelf-Stabilizing Mutual Exclusion Under Arbitrary Scheduler
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate. The mutual exclusion problem is fundamental in distributed computing, since it allows processors competing to access a shared resource to be able to synchronize and get exclusive access to the resource (i.e. execute their critical section). It is...
متن کاملUniform Randomized Self-Stabilizing Mutual Exclusion on Unidirectional Ring under Unfair C-Daemon
A distributed system consists of a set of processes and a set of communication links, each connecting a pair of processes. A distributed system is called self-stabilizing if it converges to a correct system state no matter which system state it is started with. A self-stabilizing system is considered to be an ideal fault tolerant system, since it can tolerate a nite number of transient failures...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001